Restricted drug distribution programs

REMS-Restricted Drug Distribution Programs and the Antitrust Economics of Refusals to Deal with Potential General Competitors

Learnability of Restricted Logic Programs

An active area of research in machine learning is learning logic programs from examples; this subarea is sometimes called inductive logic programming. This paper investigates this problem formally, using as our primary technical tool the method of prediction-preserving reducibilities and the model of polynomial predictability introduced by Pitt and Warmuth 1990]. We focus on the learnability of...

Inductive Counting for Width-Restricted Branching Programs

As an application of the inductive counting technique to a circuit-like model, we prove that complementation on nondeterministic branching programs can be done without increasing the width too much. A consequence of this result is that the class of languages recognized by a generalization of nonuniform nite automata (Barrington (1989)) to non-constant space is closed under complement.

Expanders and time-restricted branching programs

The replication number of a branching program is the minimum number R such that along every accepting computation at most R variables are tested more than once; the sets of variables re-tested along different computations may be different. For every branching program, this number lies between 0 (read-once programs) and the total number n of variables (general branching programs). The best resul...

Restricted demonic choice for modular probabilistic programs

It is argued that one approach to modularity in programs containing both demonic and probabilistic choice is to allow variations on the former: `restricted demonic choice', written u L , is not allowed to use the value of variables named in the set L as it resolves its nondeterminism; ordinary demonic choice u is then just the special case u fg in which the set of hidden variables is empty. The...